Well Conditioned Spherical Polynomial Systems
نویسندگان
چکیده
منابع مشابه
Least-squares Polynomial Lters for Ill-conditioned Linear Systems
An important problem which arises in several applications is to nd the solution of an ill-conditioned Symmetric Semi-Positive Deenite linear system whose right-hand side is perturbed by noise. In this situation, it is desirable for the solution to be accurate in the directions of eigenvectors associated with large eigenvalues, and to have small components in the space associated with smallest e...
متن کاملOptimal Algorithms for Well-Conditioned Nonlinear Systems of Equations
We propose to solve nonlinear systems of equations by function optimization and we give an optimal algorithm which relies on a special canonical form of gradient descent. The algorithm can be applied under certain assumptions on the function to be optimized, that is an upper{bound must exist for the norm of the Hessian, whereas the norm of the gradient must be lower{bounded. Due to its intrinsi...
متن کاملWell Conditioned Spherical Designs for Integration and Interpolation on the Two-Sphere
A set XN of N points on the unit sphere is a spherical t-design if the average value of any polynomial of degree at most t over XN is equal to the average value of the polynomial over the sphere. This paper considers the characterization and computation of spherical t-designs on the unit sphere S2 ⊂ R3 when N ≥ (t + 1)2, the dimension of the space Pt of spherical polynomials of degree at most t...
متن کاملPolynomial Internal and External Stability of Well-posed Linear Systems
We introduce polynomial stabilizability and detectability of well-posed systems in the sense that a feedback produces a polynomial stable C0–semigroup. Using these concepts, the polynomial stability of the given C0–semigroup governing the state equation can be characterized via polynomial bounds on the transfer function. We further give sufficient conditions for polynomial stabilizability and d...
متن کاملA Fast and Well-Conditioned Spectral Method
A spectral method is developed for the direct solution of linear ordinary differential equations with variable coefficients. The method leads to matrices which are almost banded, and a numerical solver is presented that takes O(m2n) operations, where m is the number of Chebyshev points needed to resolve the coefficients of the differential operator and n is the number of Chebyshev coefficients ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Approximation Theory
سال: 1999
ISSN: 0021-9045
DOI: 10.1006/jath.1999.3379